import java.util.Scanner;

/**
 * Created by Administrator on 2016/3/5.
 */
public class qsort
{
    public static void main(String[] args)
    {
        Scanner in=new Scanner(System.in);
        int N=in.nextInt();
        int[] a=new int[N];
        int i;
        for(i=0;i<N;i++)
            a[i]=in.nextInt();
        qsort(a,0,N-1);
        for(i=0;i<N;i++)
            if(i!=N-1)
                System.out.print(a[i]+" ");
            else
                System.out.println(a[i]);

    }
    public static void qsort(int[] a,int start,int end)
    {
        if(end-start<=1)
            return;

        int first=start;
        int last=end;
        int n=a[first];

        while(first<last)
        {
           while(first<last&&a[last]>=n)
               last--;
            a[first]=a[last];
            while(first<last&&a[first]<=n)
                first++;
            a[last]=a[first];
        }
        a[first]=n;
        qsort(a,start,n-1);
        qsort(a,n+1,end);
    }

}
